On super (a, d)-edge-antimagic total labeling of disconnected graphs

Title: On super (a, d)-edge-antimagic total labeling of disconnected graphs
Creator: Dafik; Miller, Mirka; Ryan, Joe; Bača, Martin
Relation: Discrete Mathematics Vol. 309, Issue 15, p. 4909-4915
Publisher Link: http://dx.doi.org/10.1016/j.disc.2008.04.031
Publisher: Elsevier
Resource Type: journal article
Date: 2009
Description: A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f : V(G) U E(G) → {1,2, . . . , p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv), uv ϵ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a,d)-edge-antimagic total properties of disconnected graphs mCn and mPn.
Subject: (a,d)-edge-antimagic total labeling; super (a,d)-edge-antimagic total labeling; mCn; mPn
Identifier: http://hdl.handle.net/1959.13/806907
Identifier: uon:7252
Identifier: ISSN:0012-365X
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format